Parallel Array-rewriting P Systems
نویسندگان
چکیده
A variant of array-rewriting P systems that uses parallel rewriting of arrays in the regions is introduced. The generative power of this model is compared with certain array grammars generating array languages. It is shown that geometric arrays such as hollow rectangles and hollow squares can be generated by parallel array P systems with a priority relation on the rules. The advantage of the proposed variant is that the number of membranes necessary for generating certain array language is reduced in the constructions as array
منابع مشابه
P Systems for Array Generation and Application to Kolam Patterns
In the area of membrane computing, a new computability model, now called P system was introduced by PAUN (2002) inspired from the cell structure and its functioning. One area of P systems deals with string objects and rewriting rules. Recently, array P systems with array objects and array rewriting rules were introduced. Here we introduce a new class of array P systems called sequential/paralle...
متن کاملMaximally Parallel Multiset-Rewriting Systems: Browsing the Configurations
The aim of this research is to produce an algorithm for the software that would let a researcher to observe the evolution of maximally parallel multiset-rewriting systems with permitting and forbidding contexts, browsing the configuration space by following transitions like following hyperlinks in the World-Wide Web. The relationships of maximally parallel multiset-rewriting systems with other ...
متن کاملInfinite Arrays and Controlled Deterministic Table 0L Array Systems
Deterministic talble OL array systems with control are considered for the generation of infinite arrays. Rewriting of a rectangular array is done in parallel by a table of rules, the rightmost edge horizontally or the lowermost edge vertically downwards. The application of the tables IS controlled by a control set. Cube-free and square-free infinite arrays are obtained as an application of this...
متن کاملStructural Operational Semantics of P Systems
The paper formally describes an operational semantics of P systems. We present an abstract syntax of P systems, then the notion of configurations, and we define the sets of inference rules corresponding to the three stages of an evolution step: maximal parallel rewriting, parallel communication, and parallel dissolving. Several results assuring the correctness of each set of inference rules are...
متن کامل(Ultimately Confluent) Parallel Multiset–Rewriting Systems with Context
The aim of this paper is to study the power of parallel multisetrewriting systems with permitting context (or P systems with non-cooperative rules with promoters). The main result obtained is that if we use promoters of weight two, then the system is universal. Moreover, the construction satisfies a special property we define: it is ultimately confluent. This means that if the system allows at ...
متن کامل